Non-Intrusive Design of Concurrently Self-Testable FSMs
نویسندگان
چکیده
We propose a methodology for non-intrusive design of concurrently self-testable FSMs. The proposed method is similar to duplication, wherein a replica of the original FSM acts as a predictor that immediately detects potential faults by comparison to the original FSM. However, instead of duplicating the complete FSM, the proposed method replicates only a minimal portion adequate to detect all possible faults, yet at the cost of introducing potential fault detection latency. Furthermore, in contrast to concurrent error detection approaches, which presume the ability to resynthesize the FSM and exploit parity-based state encoding, the proposed method is non-intrusive and does not interfere with the encoding and implementation of the original FSM. Experimental results on FSMs of various sizes and densities indicate that the proposed method detects 100% of the faults with very low average fault detection latency. Furthermore, a hardware overhead reduction of up to 33% is achieved, as compared to duplication-based concurrent error detection.
منابع مشابه
Designing of Testable Reversible QCA Circuits Using a New Reversible MUX 2×1
Recently testing of Quantum-dot Cellular Automata (QCA) Circuits has attracted a lot of attention. In this paper, QCA is investigated for testable implementations of reversible logic. To amplify testability in Reversible QCA circuits, a test method regarding to Built In Self Test technique is developed for detecting all simulated defects. A new Reversible QCA MUX 2×1 desig...
متن کاملDesigning of Testable Reversible QCA Circuits Using a New Reversible MUX 2×1
Recently testing of Quantum-dot Cellular Automata (QCA) Circuits has attracted a lot of attention. In this paper, QCA is investigated for testable implementations of reversible logic. To amplify testability in Reversible QCA circuits, a test method regarding to Built In Self Test technique is developed for detecting all simulated defects. A new Reversible QCA MUX 2×1 desig...
متن کاملDecompositional Design of Testable FSM Networks
It has been well-known that Finite State Machines (FSMs) are difficult to test. The problem of FSM testing can be regarded as an identification problem: to design input sequence (test) capable to distinguish a given (fault-free) FSM from all other (faulty) ones. Testing methods based on checking experiments theory [1,2] are not widely used in practical, because of the high upper bound of checki...
متن کاملUse of Statecharts-Related Description to Achieve Testable Design of Control Subsystems
Control-dominated architectures are eeciently described by means of graphical representations based on Statecharts. Statecharts descriptions can be automatically translated into HDL representations (VHDl or Verilog) which are directly synthesized into gate-level netlists. This paper describes a set of rules which transform, if possible, a Statecharts description into a simpler representation ba...
متن کامل